Quotients of strongly Proper Forcings and Guessing Models

نویسندگان

  • Sean Cox
  • John Krueger
چکیده

We prove that a wide class of strongly proper forcing posets have quotients with strong properties. Specifically, we prove that quotients of forcing posets which have universal strongly generic conditions on a stationary set of models by certain nice regular suborders satisfy the ω1-approximation property. We prove that the existence of stationarily many ω1-guessing models in Pω2 (H(θ)), for sufficiently large cardinals θ, is consistent with the continuum being arbitrarily large, solving a problem of Viale and Weiss [13]. Many consistency results in set theory involve factoring a forcing poset Q over a regular suborder P in a forcing extension by P, and applying properties of the quotient forcing Q/ĠP. We will be interested in the situation where Q has strongly generic conditions for elementary substructures, and we wish the quotient Q/ĠP to have similar properties. For example, the quotient Q/ĠP having the approximation property is useful for constructing models in which there is a failure of square principles or related properties. We introduce some variations of strongly generic conditions, including simple and universal conditions. Our main theorem regarding quotients is that if Q is a forcing poset with greatest lower bounds for which there are stationarily many countable elementary substructures which have universal strongly generic conditions, and P is a regular suborder of Q which relates in a nice way to Q, then P forces that Q/ĠP has the ω1-approximation property. Several variations of this theorem are given, as well as an example which shows that not all quotients of strongly proper forcings are well behaved. Previously Weiss introduced combinatorial principles which characterize supercompactness yet also make sense for successor cardinals ([13], [14]). Of particular interest to us is the principle ISP(ω2), which asserts the existence of stationarily many ω1-guessing models in Pω1(H(θ)), for sufficiently large regular cardinals θ. This principle follows from PFA and has some of same consequences, such as the failure of the approachability property on ω1. It follows that ISP(ω2) implies that 2 ≥ ω2. Viale and Weiss [13] asked whether this principle settles the value of the continuum. We solve this problem by showing that ISP(ω2) is consistent with 2 ω being arbitrarily large. The solution is an application of the quotient theorem described above and the second author’s method of adequate set forcing ([3]). Date: Submitted June 2014; revised June 2015. 2010 Mathematics Subject Classification: Primary 03E40; Secondary 03E35.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Aronszajn lines and the club filter

The purpose of this note is to demonstrate that a weak form of club guessing on ω1 implies the existence of an Aronszajn line with no Countryman suborders. An immediate consequence is that the existence of a five element basis for the uncountable linear orders does not follow from the forcing axiom for ω-proper forcings.

متن کامل

Forcing with quotients

We study an extensive connection between quotient forcings of Borel subsets of Polish spaces modulo a σ-ideal and quotient forcings of subsets of countable sets modulo an ideal.

متن کامل

1 0 Ju l 2 00 4 Forcing with quotients ∗

We study an extensive connection between factor forcings of Borel subsets of Polish spaces modulo a σ-ideal and factor forcings of subsets of countable sets modulo an ideal.

متن کامل

A classification of hull operators in archimedean lattice-ordered groups with unit

The category, or class of algebras, in the title is denoted by $bf W$. A hull operator (ho) in $bf W$ is a reflection in the category consisting of $bf W$ objects with only essential embeddings as morphisms. The proper class of all of these is $bf hoW$. The bounded monocoreflection in $bf W$ is denoted $B$. We classify the ho's by their interaction with $B$ as follows. A ``word'' is a function ...

متن کامل

The Impact of Correction for Guessing Formula on MC and Yes/No Vocabulary Tests' Scores

A standard correction for random guessing (cfg) formula on multiple-choice and Yes/Noexaminations was examined retrospectively in the scores of the intermediate female EFL learners in an English language school. The correctionwas a weighting formula for points awarded for correct answers,incorrect answers, and unanswered questions so that the expectedvalue of the increase in test score due to g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2016